Simulation Problems for One-Counter Machines
نویسندگان
چکیده
We consider decidability questions for simulation preorder (and equivalence) for processes generated by one-counter machines. We sketch a proof of decidability in the case when testing for zero is not possible, and demonstrate the undecidability in the general case.
منابع مشابه
بررسی ضرورت کنترل کیفی دستگاههای شمارنده سلول های خونی در آزمایشگاههای تشخیص طبی
Background and aim:Blood cells have an important role in human healthy, so their shapes and numbers are defined as human healthy indexes. These factors are measured by cell counter machines. Presenting a high quality report according to cell counters output is dependant on their operational accuracy. Therefore it was necessary to do a study on quality control of blood cell counter machines in s...
متن کاملAn Optimal Simulation of Counter Machines: The ACM Case
[SIAM J. on Computing, 14 (1985), 34-40]. This is a companion paper to ‘‘P.M.B. Vitanyi, An optimal simulation of counter machines, SIAM Journal on Computing, 14 (1985), 1-33, and the later ‘‘J. Seiferas and P.M.B. Vitanyi, Counting is easy, J. Assoc. Comp. Mach. 35 (1988), pp. 985-1000’’]. An Augmented Counter Machine (ACM) is a multicounter machine, with initially nonzero counters allowed, an...
متن کاملThe Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops
This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling the transitions on the loops. The proof is based on the fact that the sequence of powers {R}i=1 of such relations can be encoded as a periodic sequence of matrices, and that both the prefix and the period of this seque...
متن کاملUndecidable Problems in Unreliable Computations
Department of Computer Science, University of Edinburgh, JCMB, Edinburgh EH9 3JZ, UK. e-mail: [email protected] Abstract. Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at any time. While termination is decidable for lossy counter machines, structural termination (termination for every input) is undecidable. This und...
متن کاملLossy Counter
We consider lossy counter machines, i.e. counter machines with counters whose contents can spontaneously decrease at any time. They are not Turing-powerful, since reachability is decidable for them, but they still have interesting undecidable properties: For a lossy counter machine it is undecidable if there exists an initial connguration s.t. there is an innnite run. Lossy counter machines can...
متن کامل